منابع مشابه
Hamiltonian-connectivity and strongly Hamiltonian-laceability of folded hypercubes
In this paper, we analyze a hypercube-like structure, called the folded hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd.We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n = 1...
متن کاملHamiltonian-Connectivity and Related Property on Folded Hypercubes
In this paper, we analysis a hypercube-like structure, called the Folded Hypercube, which is basically a standard hypercube with some extra links established between its nodes. We first show that the n-dimensional folded hypercube is bipartite when n is odd. We also show that the n-dimensional folded hypercube is strongly Hamiltonian-laceable when n is odd, and is Hamiltonian-connected when n =...
متن کاملDominant Component Analysis of Electrophysiological Connectivity Networks
Connectivity matrices obtained from various modalities (DTI, MEG and fMRI) provide a unique insight into brain processes. Their high dimensionality necessitates the development of methods for population-based statistics, in the face of small sample sizes. In this paper, we present such a method applicable to functional connectivity networks, based on identifying the basis of dominant connectivi...
متن کاملComponent connectivity of generalized Petersen graphs
Let G be a simple non-complete graph of order n. The r-component edge connectivity of G denoted as λr(G) is the minimum number of edges that must be removed from G in order to obtain a graph with (at least) r connected components. The concept of r-component edge connectivity generalizes that of edge connectivity by taking into account the number of components of the resulting graph. In this pap...
متن کاملGeometry of river networks. III. Characterization of component connectivity.
Essential to understanding the overall structure of river networks is a knowledge of their detailed architecture. Here we explore the presence of randomness in river network structure and the details of its consequences. We first show that an averaged view of network architecture is provided by a proposed self-similarity statement about the scaling of drainage density, a local measure of stream...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2016
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2016.05.035